1 Discovering Non-binary Hierarchical Structures with Bayesian Rose Trees Charles Blundell,† Yee Whye Teh,† and Katherine A. Heller§ †

Source URL: www.gatsby.ucl.ac.uk

• Data management
• Phylogenetics
• Knowledge representation
• Tree
• T-tree
• R-tree
• Cluster analysis
• Maximum parsimony
• B-tree
• Statistics
• Graph theory
• Binary trees

Tamper-Evident, History-Independent, Subliminal-Free Data Structures on PROM Storage -orHow to Store Ballots on a Voting Machine (Extended Abstract) David Molnar UC Berkeley

Source URL: naveen.ksastry.com

• Electronic voting
• Electoral systems
• Computer memory
• Sociology
• Government
• Voting machine
• Voter-verified paper audit trail
• Voting system
• Ballot
• Politics
• Elections
• Election fraud

DETERMINISTIC FULLY DYNAMIC DATA STRUCTURES FOR VERTEX COVER AND MATCHING. DR. SAYAN BHATTACHARYA Abstract We present the first deterministic data structures for maintaining approximate minimum vertex cover and √

Source URL: www.isichennai.res.in

Dynamically Transforming Data Structures ¨ Erik Osterlund Welf L¨owe

Source URL: welf.se

DSSR: a software program for Defining the Secondary Structures of RNA from three-dimensional coordinates

Source URL: x3dna.bio.columbia.edu

• Science
• STING
• Pseudoknot
• Protein Data Bank
• Structural bioinformatics
• Jmol
• RNA
• Genetics
• Biology

Data Structures Considered Harmful John G. Cleary, Mark Utting, and Roger Clayton University of Waikato, Hamilton, New Zealand. {jcleary,marku,rjc4}@cs.waikato.ac.nz

Source URL: www.cs.waikato.ac.nz

• Logic in computer science
• Non-classical logic
• Query languages
• Prolog
• Logic programming
• Denotational semantics
• Programming language
• Logic
• Modal logic
• Software engineering
• Computing
• Computer programming

Data Structures David Morgan A list

Source URL: homepage.smc.edu

• Abstract data types
• Subroutines
• Stack
• Pointer
• Linked list
• Queue
• C
• Call stack
• Stack buffer overflow
• Software engineering
• Computing
• Computer programming

Indexing Structures for ash based Solid State Drives SeungBum Jo1,3 , Vineet Pandey2,3 , and S. Srinivasa Rao1 1 School of Computer Science and Engineering, Seoul National University, Seoul, Republic of Korea sb

Source URL: www.hipc.org

• Data management
• Binary trees
• B+ tree
• Trie
• Tree traversal
• Database index
• Tree
• Flash memory
• Tango tree
• B-tree
• Graph theory
• Computing

Cache-Oblivious Data Structures for Orthogonal Range Searching Pankaj K. Agarwal∗ Lars Arge†

Source URL: www.cs.swarthmore.edu

• Cache
• Computer science
• Cache-oblivious algorithm
• K-d tree
• Binary logarithm
• Computational geometry
• Range tree
• Fast Fourier transform
• Bin
• Mathematics
• Computing
• Analysis of algorithms

Upper and Lower Bounds for Text Indexing Data Structures by Alexander Golynski A thesis

Source URL: cs.uwaterloo.ca